Noisy 1-Bit Compressed Sensing Embeddings Enjoy a Restricted Isometry Property
نویسنده
چکیده
We investigate the sign-linear embeddings of 1-bit compressed sensing given by Gaussian measurements. One can give short arguments concerning a Restricted Isometry Property of such maps using Vapnik-Chervonenkis dimension of sparse hemispheres. This approach has a natural extension to the presence of additive white noise prior to quantization. Noisy one-bit mappings are shown to satisfy an RIP when the metric on the sphere is given by the noise.
منابع مشابه
New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property
Consider anm×N matrix Φ with the Restricted Isometry Property of order k and level δ, that is, the norm of any k-sparse vector in R is preserved to within a multiplicative factor of 1±δ under application of Φ. We show that by randomizing the column signs of such a matrix Φ, the resulting map with high probability embeds any fixed set of p = O(e) points in R into R without distorting the norm of...
متن کامل1 Minimization with Noisy Data
Compressed sensing aims at recovering a sparse signal x ∈ RN from few nonadaptive, linear measurements Φ(x) given by a measurement matrix Φ. One of the fundamental recovery algorithms is an `1 minimisation. In this paper we investigate the situation when our measurement Φ(x) is contaminated by arbitrary noise under the assumption that the matrix Φ satisfies the restricted isometry property. Thi...
متن کاملDeterministic Compressed Sensing Matrices from Additive Character Sequences
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a K×N measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for N = K, and to present a sufficient condition on the ...
متن کاملCorrelations and Anticorrelations in LDA Inference
Inference of the document-specific topic distributions in latent Dirichlet allocation (LDA) [2] and decoding in compressed sensing [3] exhibit many similarities. Given a matrix and a noisy observed vector, the goal of both tasks is to recover a sparse vector that, when combined with the matrix, provides a good explanation of the noisy observed data. In the case of LDA, the matrix corresponds to...
متن کاملA Compressed Introduction to Compressed Sensing
We attempt to convey a sense of compressed sensing. Specifically, we discuss how `1 minimization and the restricted isometry property for matrices can be used for sparse recovery of underdetermined linear systems even in the presence of noise.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1604.03499 شماره
صفحات -
تاریخ انتشار 2016